A Rewrite Approach for Pattern Containment - Application to Query Evaluation on Compressed Documents
نویسنده
چکیده
In this paper we introduce an approach that allows to handle the containment problem for the fragment XP(/,//,[ ],∗) of XPath. Using rewriting techniques we define a necessary and sufficient condition for pattern containment. This rewrite view is then adapted to query evaluation on XML documents, and remains valid even if the documents are given in a compressed form, as dags.
منابع مشابه
A Rewrite Approach for Pattern Containment
In this paper we introduce an approach that allows to handle the containment problem for the fragment XP(/,//,[ ],∗) of XPath. Using rewriting techniques we define a necessary and sufficient condition for pattern containment. This rewrite view is then adapted to query evaluation on XML documents, and remains valid even if the documents are given in a compressed form, as dags.
متن کاملEfficient Multi-Query Evaluation over Compressed XML Data in a Distributed Environment
With increasing dissemination of XML, multi-query processing has become a practical and meaningful issue to resolve. However, the verbosity of XML data causes inefficient query processing and high network bandwidth consumption. This paper addresses the problem of evaluating a heavy load of subscribed queries as a whole (or simply multiqueries) over compressed XML data in a distributed environme...
متن کاملLocating XML Documents Using Content and Structure Synopses
In this paper, we present a novel framework for locating schema-less XML documents based on concise data synopses extracted from the documents. We introduce two novel data synopses, content synopsis and positional filter, to summarize the text data in an XML document for the query evaluation. These two data synopses correlate textual with positional information and consider the containment rela...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملRRLUFF: Ranking function based on Reinforcement Learning using User Feedback and Web Document Features
Principal aim of a search engine is to provide the sorted results according to user’s requirements. To achieve this aim, it employs ranking methods to rank the web documents based on their significance and relevance to user query. The novelty of this paper is to provide user feedback-based ranking algorithm using reinforcement learning. The proposed algorithm is called RRLUFF, in which the rank...
متن کامل